Asynchronous Multi-Party Computation with Quadratic Communication
نویسندگان
چکیده
We present an efficient protocol for secure multi-party computation in the asynchronous model with optimal resilience. For n parties, up to t < n/3 of them being corrupted, and security parameter κ, a circuit with c gates can be securely computed with communication complexityO(cnκ) bits, which improves on the previously known solutions by a factor of Ω(n). The construction of the protocol follows the approach introduced by Franklin and Haber (Crypto’93), based on a public-key encryption scheme with threshold decryption. To achieve the quadratic complexity, we employ several techniques, including circuit randomization due to Beaver (Crypto’91), and an abstraction of certificates, which can be of independent interest.
منابع مشابه
Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience
We consider secure multi-party computation in the asynchronous model and present an efficient protocol with optimal resilience. For n parties, up to t < n/3 of them being corrupted, and security parameter κ, a circuit with c gates can be securely computed with communication complexity O(cnκ) bits. In contrast to all previous asynchronous protocols with optimal resilience, our protocol requires ...
متن کاملAn Asynchronous Multi-Party Computation Protocol
We consider secure multi-party computation in the asynchronous model and present an efficient protocol with optimal resilience. For n parties, up to t < n/3 of them being corrupted, and security parameter κ, a circuit with c gates can be securely computed with communication complexity O(cnκ) bits. In contrast to all previous asynchronous protocols with optimal resilience, our protocol requires ...
متن کاملBreaking the O(nm) Bit Barrier: Secure Multiparty Computation with a Static Adversary
We describe scalable protocols for solving the secure multi-party computation (MPC) problem among a large number of parties. We consider both the synchronous and the asynchronous communication models. In the synchronous setting, our protocol is secure against a static malicious adversary corrupting less than a 1/3 fraction of the parties. In the asynchronous setting, we allow the adversary to c...
متن کاملRound and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network
In this work, we study unconditionally-secure multi-party computation (MPC) tolerating t < n/3 corruptions, where n is the total number of parties involved. In this setting, it is well known that if the underlying network is completely asynchronous, then one can achieve only statistical security; moreover it is impossible to ensure input provision and consider inputs of all the honest parties. ...
متن کاملConstant-Round Asynchronous Multi-Party Computation
Secure multi-party computation (MPC) allows several mutually distrustful parties to securely compute a joint function of their inputs and exists in two main variants: In synchronous MPC parties are connected by a synchronous network with a global clock, and protocols proceed in rounds with strong delivery guarantees, whereas asynchronous MPC protocols can be deployed even in networks that deliv...
متن کامل